A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
نویسندگان
چکیده
منابع مشابه
A Sparse-Sparse Iteration for Computing a Sparse Incomplete Factorization of the Inverse of an SPD Matrix
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a preconditioner for solving symmetric positive definite linear systems of equations by using the preconditioned conjugate gradient algorithm. Some numerical experime...
متن کاملSparse Matrix Factorization
We investigate the problem of factoring a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where finding a factorization corresponds to finding edges in different layers and also values of hidden units. We prove that under certain assumptions on a sparse li...
متن کاملProbabilistic Sparse Matrix Factorization
Many kinds of data can be viewed as consisting of a set of vectors, each of which is a noisy combination of a small number of noisy prototype vectors. Physically, these prototype vectors may correspond to different hidden variables that play a role in determining the measured data. For example, a gene’s expression is influenced by the presence of transcription factor proteins, and two genes may...
متن کاملA new approach to compute sparse approximate inverse of an SPD matrix
The accelerated overrelaxation (AOR) iterative method is a stationary iterative method for solving linear system of equations. In this paper, a generalization of the AOR iterative method is presented and its convergence properties are studied. Some numerical experiments are given to show the efficiency of the proposed method. AMS Mathematics Subject Classification: 65F10.
متن کاملOnline Learning for Matrix Factorization and Sparse Coding Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statistics. This paper focuses on the large-scale matrix factorization problem that consists of learning the basis set, adapting it to specific data. Variations of this problem include dictionary learning in signal processing, non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 2009
ISSN: 0168-9274
DOI: 10.1016/j.apnum.2008.07.002